Minimizing Expected Attacking Cost in Networks
نویسندگان
چکیده
منابع مشابه
Minimizing Expected Attacking Cost in Networks
A branch-and-bound algorithm is devised to determine the optimal attack strategy to disconnect a network where the objective is to minimize the expected attacking cost. The attacker cannot launch an attack if its cost is beyond his available budget or its probability of success falls below a threshold level. The proposed branch-andbound algorithm includes, among other features, a dynamic progra...
متن کاملMinimizing Expected Broadcast Time in Unreliable Networks
When communication lines in an interconnection network are prone to random transmission failures, the time required to broadcast a message throughout the network from a given source vertex is uncertain. We view this broadcast time in such unreliable networks as a random variable dependent on the strategy employed by individual nodes to inform their neighbours, and we seek to describe those stra...
متن کاملPath Planning for Minimizing the Expected Cost till Success
Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost till success. In this paper, it is our goal to bring a foundational understanding to this problem. We start b...
متن کاملEvaluating Cost Efficiency in Fuzzy Environment by Using Expected Value
Today, one of the most fundamental issues within the field of industrial and nonindustrial activities is evaluate the costs performance of the units which are associated with industrial and nonindustrial activities. Data envelopment analysis (DEA) is a nonparametric method for evaluating performance. Fuzzy sets theory is a powerful tool for mentioning ambiguous situations. Traditional DEA model...
متن کاملMinimizing Average Spraying Cost for Routing in Delay Tolerant Networks
In this paper, we study cost efficient multi-copy spraying algorithm for routing in Delay Tolerant Networks (DTN) in which source-to-destination path does not exist most of the time. We present a novel idea and the corresponding algorithm for achieving the average minimum cost of packet transmission while maintaining the desired delivery rate by the given deadline. The number of message copies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2010
ISSN: 1571-0653
DOI: 10.1016/j.endm.2010.05.120